Linear approximation of shortest superstrings
نویسندگان
چکیده
منابع مشابه
Sequential and Parallel Approximation of Shortest Superstrings
Superstrings have many applications in data compression and genetics. However, the decision version of the shortest superstring problem is N P-complete. In this paper we examine the complexity of approximating shortest superstrings. There are two basic measures of the approximations: the length factor and the compression factor. The well known and practical approximation algorithm is the sequen...
متن کاملParallel and Sequential Approximations of Shortest Superstrings
Superstrings have many applications in data compression and genetics. However the decision version of the shortest superstring problem is NP-complete. In this paper we examine the complexity of approximating a shortest superstring. There are two basic measures of the approximations: the compression ratio and the approximation ratio. The well known and practical approximation algorithm is the se...
متن کاملShortest Consistent Superstrings Computable in Polynomial Time
The shortest consistent superstring problem is, given a set of positive strings and a set of negative strings, finding a shortest string including every positive string and no negative string as a substrin& This problem is NP-hard and arises in DNA sequencing by hybridization. It is also an extension of the well-known shortest cotillion superstring problem which corresponds to the case when the...
متن کاملApproximation Solutions for Time-Varying Shortest Path Problem
Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path problem, in which can be optimally solved in O(T(m + n)) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, whic...
متن کاملShortest Common Superstrings and Scheduling with Coordinated Starting Times
In the first part of this paper we show that the Shortest Common Superstring problem is NP-complete even if all strings are of the simple form 10plOq, p,q E N. This result closes the gap left between the polynomial cases where all strings are of the form Op104 or all strings are of the form lop1 and NP-complete cases when strings have a more complicated structure. In the second part of the pape...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 1994
ISSN: 0004-5411,1557-735X
DOI: 10.1145/179812.179818